منابع مشابه
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly, approximation methods become the best option. Mini-bucket Elimination (MBE) is a well known approximation method for combinatorial optimization problems. It has a control parameter z that allow us to trade time and s...
متن کاملThe Token Bucket Allocation and Reallocation Problems ( MPRASE Token Bucket )
This paper deals with the dimensioning of token buckets. Two related problems are formulated and solved. The first is the token bucket allocation problem (TBAP) which is finding the cost-minimal token bucket for the transmission of a given VBR traffic stream, e.g. an MPEG movie, from the user's point of view. This problem has been treated in literature before but as we will show not completely....
متن کاملGeometric Bucket Trees: Analysis of Linear Bucket Tree
We analyse the average number of buckets in a Linear Bucket tree created by n points uniformly dispatched on an interval of length y. A new bucket is created when a point does not fall in an existing bucket. The bucket is the interval of length 2 centered on the point. We illustrate this concept by an interesting tale of how the moon’s surface took on its present form. Thanks to an explicit Lap...
متن کامل"Bucket auctions" for charity
a r t i c l e i n f o a b s t r a c t Donations in-kind can be a mixed blessing for charities, who are often more adept at solicitation than resale. Many organizations rely on raffles to turn donations into cash, but auctions are also common. Theory predicts that all-pay mechanisms should produce more revenue than winner-pay mechanisms, but the empirical literature is thin and inconclusive. Dra...
متن کاملParallel Bucket Sorting Algorithm
Bucket sorting algorithm achieves O(n) running time complexity in average. It is very fast compared to any comparison-based sorting algorithms that usually have a lower bound of Ω(n log n). Given an unsorted array of n positive integers, bucket sorting algorithm works by distributing the elements into m ordered buckets each contains zero or more elements. Each bucket is then sorted using either...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Iowa Review
سال: 1989
ISSN: 0021-065X,2330-0361
DOI: 10.17077/0021-065x.3711